Connectivity Analysis of Cyclically Balanced Fuzzy Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced Intuitionistic Fuzzy Graphs

In this paper, we introduce the notion of balanced intuitionistic fuzzy graphs and present some of their properties. We also prove that G1 G2 is balanced if and only if D(G1) = D(G2) = D(G1 G2). Mathematics Subject Classification: 05C72, 03E72, 03F55

متن کامل

Balanced Bipolar Intuitionistic Fuzzy Graphs

In this paper, we discuss balanced bipolar intuitionistic fuzzy graphs and study some of their properties 1.Introduction Graph theory is developed when Euler gave the solution to the famous Konigsberg bridge problem in 1736. Graph theory is very useful as a branch of combinatorics in the field of geometry, algebra, number theory, topology, operations research, optimization and computer science....

متن کامل

Incidence cuts and connectivity in fuzzy incidence graphs

Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...

متن کامل

Cyclically Orientable Graphs

Barot, Geiss and Zelevinsky define a notion of a “cyclically orientable graph” and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky’s work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically orientable graphs, and use this to give ...

متن کامل

On cyclically embeddable graphs

An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fuzzy Information and Engineering

سال: 2015

ISSN: 1616-8658,1616-8666

DOI: 10.1016/j.fiae.2015.05.008